Processing of multilayer weave design data

ABSTRACT

Technique for developing a multilayer weave design matrix from individual weave pattern matrices for the respective layers, the final matrix being in the form of binary operating instructions to a loom for actuating the warp threads in such a way as to provide the desired multilayer weave design. The individual layer matrices first are assembled into a block diagonal form of matrix in which these layer matrices are arranged as nonoverlapping, diagonally adjacent blocks, on one side of which (e.g., lower side) the large matrix is filled with bits of one value (e.g., 1&#39;&#39;s), while on the other side of the diagonal blocks (e.g., upper side) the large matrix is filled with bits of the opposite value (e.g., 0&#39;&#39;s). Row and column interleaving operations then are performed so that in the final matrix the rows and columns of each layer matrix are interspersed as evenly as possible with those of the other matrices. If interconnections between layers are desired, these are specified in the large matrix before its transformation, merely by changing the value of the 1 or 0 bit whose coordinates are the particular row of one layer and the particular column of the other layer which are to be interconnected or interlaced.

United States Patent Janice Richmond Lourie;

[72] Inventors Lin S. Woo, both of New York, N.Y. [21] Appl. No. 29,228[22] Filed Apr. 16, 1970 [45] Patented Jan. 11, 1972 [73] AssigneeInternational Business Machines Corporation Armonk, N.Y.

[54] PROCESSING OF MULTILAYER WEAVE DESIGN DATA 10 Claims, 33 DrawingFigs.

[52] US. Cl 340/172.5, 444/1 [5 1] Int. Cl G061 9/06, D03d 49/00 [50]Field of Search 340/1725; 139/317, 318, 319; 112/78, 79

[56] References Cited UNITED STATES PATENTS 3,129,411 4/1964 Albrecht340/1725 X 3,247,815 4/1966 Polevitzky 112/79 3,425,038 1/1969 Trousdale340/1725 3,529,298 9/1970 Lourie 350/1725 HEDDLE ACTUATOR PrimaryExaminer- Paul J. Henon Assistant Exam iner- Paul R. WoodsAnorney.rHanifin and Jancin and Charles P. Boherg ABSTRACT: Techniquefor developing a multilayer weave design matrix from individual weavepattern matrices for the respective layers, the final matrix being inthe form of binary operating instructions to a loom for actuating thewarp threads in such a way as to provide the desired multilayer weavedesign. The individual layer matrices first are assembled into a blockdiagonal form of matrix in which these layer matrices are arranged asnonoverlapping, diagonally adjacent blocks, on one side ofwhich (e.g.,lower side) the large matrix is filled with bits of one value (e.g.,1's), while on the other side of the diagonal blocks (e.g., upper side)the large matrix is filled with bits of the opposite value (eg, 0's).Row and column interleaving operations then are performed so that in thefinal matrix the rows and columns of each layer matrix are interspersedas evenly as possible with those of the other matrices. lfinterconnections between layers are desired, these are specified in thelarge matrix before its transformation, merely by changing the value ofthe l or 0 bit whose coordinates are the particular row of one layer andthe particular column of the other layer which are to be interconnectedor interlaced.

PATTERN SELECTOR PATENTEU m1 1 1972 FIG.

3.63432? SHEET 01 0F 20 HEDDLE PATTERN ACTUATO R SELECTOR BASIC REPEAT0F PATTERN INVENTORS JANICE RICHMOND LOURIE LIN 5. W00

ATTORNEY PATENTEDJA 1 1972 3,634,827 SHEET 03m 20 FIG. 7

1 WEFT 4 I WEFT 2 l I =WEFT5 0 o k L A WEFT s WARP wmRP WARP WARPPATENTEOJANI 1 12172 $634,827 SHEET sum 20 FIG. 8

COL. COL. COL COL. COL. COL.

COL. COL COL. COL COL. COL.

' o/i/o/o/ ROW 2 COLUMN 5 LNTERLACEO ROW 5 & COLUMN 2 INTERLACED m.LAYER MATRIX 1ST LAYER ROW SIZE=5 COLUMN S1ZE=7 F1 6. 12 W3 LAYER MATRIX3RD LAYER ROW SIZE= 2 COLUMN S1ZE=4 1 ROW N0.

COLUMN N0. 1

SHEET ESUF 2O ROWNO.

001mm N0.

Fl G. 11

LAYER MATRIX 2ND LAYER ROW SIZE=4 COLUMN SIZE=3 z m V q 0 0 0 O 0 0 0 00 0 1 0 O 0 O 0 0 0 0 0 0 1 0 0 0 0 0 AU 0 0 0 1 0 O 0 0 0 0 0 O O 0 1 0O 0 0 O 0 0 0 1 1 1 1 O 0 0 0 1 0 1 0 1 1 2 w 0 0 0 1 1 0 0 1 1 0 1 1 11 1 1 1 1 l O 1 0 1 1 1 1 1 1 1 1 p K m COLUMN No. 1

PATENTEU JAN] 1 1972 ROW N0.

Fl G. 13

m N m m M m Mr S N BA (R T coumn N0.+1

DIAGONAL MATRIX z 3 PATENTED JAN] 1 I972 SHEET USUF 20 COLUMN NOS- 1 5 67 8 9 1011 12 13 14 OLD NEW ROW ROW NOS. NOS.

INTERMEDIATE MATRIX Z' FORMED BY ROW INTERLEAVING OLD COLUMN NOS. 1 2 38 NEWCOLUMN NOS-* 2 3 4 5 6 7 8 9 1O l l l l l l l l' ROW NOS.

(AFTER COLUMN INTERLEAVING) PATENTEUJANT T |HT2 3.634827 sHEET [WM 20 GmTeA LEGEND K =NUMBER OF LAYERS XY =L|ST OF SUCCESSIVE ROWS OF 1ST LAYERMATRIX FOLLOWED BY SUCCESSIVE ROWS OF 2ND LAYER MATRIX,ETC.,THROUCH THEK'TH LAYER,ALL ARRANGED IN VECTOR FORMAT M =VECTOR WHOSE COMPONENTS ARETHE ROW SIZES OF THE RESPECTIVE LAYER MATRICES F lg. 16 N =VECTOR wHosECOMPONENTS ARE THE COLUMN SIZES OF THE RESPECTIVE "DEV" ROUTINE FORLAYER TRICES L =CURRENT LAYER NUMBER DEVELOPING MULTILAYER H=2-COMPONENT VECTOR WHOSE 1ST WEAVE MATRIX FROM COMPONENT IS THESPECIFIED Row SIZE WEAVE MATRICES 0F AND wHosE 2ND COMPONENT IS THESPECIFIED COLUMN SIZE 'NDW'DUAL LAYERS J =CURRENT Row NUMBER IN LAYERRATRYx x =AN ARRAY HAVING THE NUMBER OF ELEMENTS SPECIFIED BY H 16A MS=TOTAL NUMBER OF Rows IN ALL LAYER MATRICES NS =T0TAL NUMBER OF COLUMNSIN ALL LAYER MATRICES 168 MY =VECTOR HAVING COMPONENTS MS AND NS 2=MULTILAYER DIAGONAL HATRTx,

BEFORE TRANSFORMATION MR =LENGTH 0F 1's STRING INSERTED INTO cuRREHT Row0F 2 166 P =CURRENT Row NUMBER IN 2 ROT=LENGTH 0E sTRHYc 0F BITS FROMcuRREHT LAYER MATRIX INSERTED INTO CURRENT Row 0F z 160 vH =RowINTERLEAVING vEcToR VN COLUMN INTERLEAVING mm A 2' =MATRIX FORMED BYAPPLYING ROW FIG, INTERLEAVING PROCESS T0 z 165 z" =F|NAL MULTILAYERHEAvE MATRIX FORMED BY APPLYING COLUMN INTERLEAVING PROCESS To 2' FIG.16F

PATENTEDJKNT T T972 3.634.827

SHEET 080T 20 F I G T 6 B OPERATOR CALLS "DEV AND SPECI F ES NU M BE ROF LAY ERS KI E.G., DEV 3 START PREPARE SYSTEM TO RECEIVE XY, M AND N ASVECTORS. (I.E., INITIALIZE XY,M AND N DI TO VECTORS IIIITH N0COMPONENTS.)

SET L IS K 2 T TEsT TO DETERMINE 4 YES D3 wRETRER K 15 IN PERMISSIBLERANGE T or VALUES IS K 10 T YES TNO EXITIVFROM ROUTINE TNcRENENT L BY 104 PRINT MESSAGE "LAYER NUMBER: \DS

PRINT VALUE OF L.

PRINT MESSAGE "ENTER ROW AND COLUMN SIZE" DC OPERATOR ENTERS COMPONENTSOF H. (I.E., ROVI SIZE AND COLUMN SIZE OF DT CURRENT LAYER MATRIX.)

PRINT MESSAGE ENTER LAYER MATRIX \08 ONE ROVI AT A TIME" FIG.1'6C

SET J =O DO FORM )I AS AN ARRAY SPECIFIED BY THE COMPONENTS OF VECTOR H,OIO EACH ELEMENT OF THIS ARRAY BEING 0 INCREMENT J BYI OII SPECIFY J'THCOMPONENT OF X. II.E., OPERATOR ENTERS J'TH ROW OF \mz CURRENT LAYERMATRIX INTO CORRESPONDING ROVI OF ARRAY X.)

IS J 1ST COMPONENT OF H I \DB (I.E., DO ANY ROIIIS REMAIN TO BESPECIFIED YES NO PRINT MESSAGE "LAYERI' PRINT VALUE OF L.

PRINT MESSAGE "LAYER MATRIX IS." DI4 PRINT VALUE OF X.(I.E., THE

VIEAVE PATTERN OF THE CURRENT LAYER.)

APPENO TO VECTOR N THE 1ST COMPONENT \015 OF VECTOR H.(I.E., THE CURRENTROYI SIZE.)

APPENO TO VECTOR N THE 2ND COMPONENT OF VECTOR H.(I.E., THE CURRENTCOLUMN SIZE.)

SHEET lUUF 2O REPRESENT ARRAY X AS AN EXTENDED VECTOR HAVING THE NUMBEROF COMPONENTS SPECIFIED BY THE COMPONENTS OF VECTOR H MULTIPLIEDTOGETHER DIT APPEND VECTOR X TO VECTOR XY. (I.E., ADD THE CURRENT LAYERMATRIX IN \018 ITS EXTENDED VECTOR FORM TO THE SIMILAR REPRESENTATION OFALL PREVIOUS LAYERS.)

I FIG, 16D PRINT VECTOR XY me I IS L K? \020 (I.E., ARE ANY LAYERS LEFTTO BE PROCESSED?) NO YES SET MS SUM OF ALL COMPONENTS \021 OF M. (I.E.,TOTAL NUMBER OF ROIIIS.)

SET NS SUM OF ALL COMPONENTS \022 OF N. (I.E., TOTAL NUMBER OF COLUMNS.)

SET MY= Z-COMPONENT VECTOR WHOSE 1ST VALUE IS MS AND VIHOSE 2ND VALUE ISNS. (I.E., FORM VECTOR CIVINC TOTAL NUMBERS OF ROVIS AND COLUMNS.)

PATENTED JAIII I I872 FIG.I6E

SHEET 11 OF 2O START FORMI INCREMENT L DYI 026 m; THE FINAL MULTILAYERMATRIX, PROCESSING ONE ROW AT A TIME COMPONENT OF N.

OF CURRENT LAYER.)

SET ROT L'TH (I.E., COLUMN SIZE SET J =O DZB INCREMENT J BYI 029INCREMENT P BY1 DSO CONSTRUCT THE P'TH ROVII OF Z AS FOLLOWS: TO THELEFT OF THE CURRENT P'TH ROYJ OF Z (ALL O'S) APPEND THE FIRST ROTELEMENTS OF VECTOR XV; THEN TO THE LEFT OF THAT APPEND A STRING OF I'SHAVING THE LENGTH MR; AND FINALLY LIMIT THE LENGTH OF THE ROIV TO NSELEMENTS STARTING WITH THE CURRENT LEFTMOST ELEMENT, THEREBY ELIMINATINGANY SUPERFLUOUS ZEROS AT THE RIGHT END OF THE ROVI AND CAUSING THEPROPER NUMBER OF I'S TO BE PLACED AT THE LEFT END OF THE STRING.

FORM A NEIV VECTOR XY BY ROTATING THE CURRENT XY VECTOR LEFT BY ROTPOSITIONS PATENTEDJAIIIIIST 3634327 SHEET 1.2 OF 20 IS J M [L] (I.E., DOANY ROWS OF THE CURRENT LAYER DZSS MATRIX REMAIN TO BE PROCESSED 'I) YESno SET NR CURRENT MR VALUE PLUS L'TH ELEMENT OF N. (I.E., ADO COL. SIZEOF LAYER DZA JUST PROCESSED TO LENGTH OF 1'S STRING.)

IS L N \DBS II.E., IS ANY LAYER LEFT TO BE PROCESSED?) YES NO PRINTMESSAGE "MATRIX BEFORE TRANSFORMATION IS" K036 PRINT THE MATRIX Z.

SEE "CON" SUBROUTINE, FIGS. 21A T0 210 SET VECTOR VM= RESULT OF APPLYINGSUBROUTINE "INT" TO THE VECTOR M AS ARGUMENT. \037 (IE, FORM THE ROWINTERLEAVING VECTOR VM.) SEE FIGS. ITA AND 175 FIG. 16F

SET VECTOR VN RESULT OF APPLYING SUBROUTINE "INT" TO THE VECTOR N ASARGUMENT. 038 (IE, FORM THE COLUMN INTERLEAVING VECTOR VN.)

FORM A NEW MATRIX Z BY INTERLEAVING ROIVS OF Z IN ACCORDANCE WITH ROWINTERLEAVING VECTOR VM FORM A NEW MATRIX Z" BY INTERLEAVING COLUMNS OF1' IN ACCORDANCE WITH D IO COLUMN INTERLEAVING MATRIX VN PRINT MESSAGE"FINAL MATRIX IS." PRINT FINAL MULTILAYER IIIEAVE MATRIX Z.

PATENTEI) JART 1 I972 SHEET 13 0F 20 FROM STEP D36, FIG.I6F

FIG. SETF=0 II H617 l FIG. PREPARE SYSTEM TO RECEIVE VM AS A 175VECTOR.II.E., INITIALIZE VM TOA VECTOR WITH NO COMPONENTS.)

SET A SMALLEST COMPONENT OF VECTOR M.II.E.,SMALLEST ROW SIZE /I3 AMONGALL LAYERS.)

SET L 0 -I4 INCREMENT L BY I I5 SET-B INTECER PORTION OF OUOTIENT FORMEDBY DIVIOING L'TH ELEMENT OFMII.E.,CURRENT ROW SIZE) BY A SET G=O I9 IPREPARE SYSTEM TO RECEIVE PR AS A VECTORAIE, INITIALIZE PR TO A VECTORWITH NO COMPONENTS) IIO SETS=F INCREMENT G BY I FIG. IA

F= INTERMEDIATE VALUE, SCALAR A=SMALLEST ROW SIZE (OR COLUMN SIZE) VM=VECTOR WHOSE FINAL VALUE WILL BE THE ROW INTERLEAVINC VECTOR M= LIST OFROW SIZES L= CURRENT LAYER NUMBER C=INDEX VALUE WHICH GOES FROM 0 TO APR=INTERMEOIATE VALUE VECTOR S= NEW TEMPORARY NUMBER ASSIGNED TO ROWIORCOLUMN) FOR RE-ORDERINC PURPOSES U=INDEX VALUE WHICH GOES FROM 0 TOBK=NUMBER OF LAYERS PATENTED m1 1 I972 3.834.827 SHEET in HF 20 T TSETU=0 -/I15 H6178 INCREMENT U 8Y1 /IT4 MODIFY VECTOR PR BY APPENDINC/I15 TO IT 8 I YES NO T |sc=0? l/m 7 YES NO MODIFY VECTOR PR BYAPPENDINCI18 TO ITS DECREMENT C BY1 ---I|9 I INCRENENT 5 BY 100 I20 IS G A? M121IYES N0 MODIFY VECTOR VM BY APPENDING A22 T0 IT VECTOR PR ANY LAYERSLEFT l TOBEPROCESSED? |SL K? /I23 N0 YES DETERMINE THE PERMUTATION WHICHWILL ARRANGE THE COMPONENTS OF VECTOR /I24 VM IN ASCENDINC ORDER,AND SETVM=THIS NEW PERMUTATTON NOTE= COLUMN INTERLEAVING PROCESS PRINT ROWINTERLEAVING VECTOR.) g' To ROW 'NTERLEM'HG ROCESS (STEP nansnowuHEREIN, E EXCEPT THAT COLUMNSIZE VECTORN Ts USED IN PLACE or ROW SIZEVECTOR M, AND THE OUTPUT WILL BE THE E TQ coumu INTERLEAVING VECTOR VN.

11111111111111 1112 3.634.827 SHEET 1 HF 20 FIG. 18

FORMATION OF ROW INTERLEAVING VECTOR VM (STEP D37, FIG. 16F) NAMEAND/ORSYMBOL SMALLEST ROW SIZE (A) 2 LAYER NUMBER 1 1 2 a Row SIZE 11[L] 5 4 2B 2 1 c 1 o 0 o 5 1o 10 10 110 20 20 120 so 150 VECTOR PR 10, 10, 10,me, 110 20, 20, 120, 120 so, 11111111 VECTOR v11 10, 10, 10, 110, 110,20, 20, 120, 120, so, 130 gggm g gs 'y 1o 10 1o 20 20 so 110 110 120 120130 FINAL VECTOR v11 11%?c 11 L R A S s I Is 1 2 3 6 7 4 5 8 9 ELEMENTSUP) FINAL Row NUMBERS 1 2 a 4 5 s 1 a 9 1o 11 PATENTED JAN? I I972 3 63427 SHEET 17UF 20 AAA; 1

INTERSECTION 0F ROW m w1 AND M COLUMN m ws TO BE INTERCONNECTED m FINALMATRIX ;I LAYER2 INTERSECTION oF/ MATRIX now In W2 AND COLUMN IN W1 TO MBE INTERCONNECTED ALL \LAYER3 IN FINAL MATRIX MATRIX (CHANGE '1" T0 "0")MAIN STORAGE PROGRAM SCAM mm MATR'X MISCELLANEOUS STORES VALUE VALUE 0RARRAY STORES STORES STORES STORES 32 cPu CHANNEL 2% TERMINAL s4 asPATENTEII JANI I I872 saw 18OF 2o 33' FIG. 2

"CON" SUBROUTINE HG, FOR INTERCONNECTING LAYERS 21:; AT DESIGNATEDPOINTS (THIS SUBROUTINE IS INSERTE'D HG BETWEEN STEPS D36 AND D37 OF"DEV" ROUTINE, FIG.I6F)

I-' FROM STEP 536, FIG. 16F PRINT MESSAGE "ENTER NUMBER OF LAYERINTERCONNECTIONS" OPERATOR ENTERS T.

I NUMBER OF INTERCONNECTIONS I IF F0 PREPARE SYSTEM TO RECEIVE 0 AS AEXIT To f VECTOR. I I.E., INITIALIZE 0 TO A D37, HG. 16F VECTOR VIITH NOCOMPONENTS.)

PRINT MESSAGE "FOR EACH PAIR OF LAYERS TO BE INTERCONNECTED, ENTER LAYERNUMBER AND ROYI NUMBER OF FIRST LAYER FOLLOWED BY LAYER NUMBER ANDCOLUMN NUMBER OF SECOND LAYER OPERATOR ENTERS COMPONENTS OF VECTOR O,FOLLOWING PRINTED INSTRUCTIONS PATENTEO JANT 1 1972 A 3.634.827 SHEETlSOF 20 FIG. 215

T SET O1=VALUE OF 1ST COMPONENT OF 0.

(NUMBER OF FIRST LAYER) T SET O2- VALUE OF 2ND COMPONENT OF O. \07

(RONNUMBER IN FIRST LAYER) SET 03 -VALUE OF 3RD COMPONENT OF 0.

(NUMBER OF SECOND LAYER) SET O4-VALUE OF 4TH COMPONENT OF O. N09

(COLUMN NUMBER IN SECOND LAYER) SET V1= 01-1 010 SET V2 SUM OF O2 PLUSTHE FIRST V1 COMPONENTS OF M. OH

(I.E., FIND CORRESPONDING ROW N0. IN Z.)

SET V3 03-1 FORM R AS A VECTOR HAVING NS COMPONENTS, EACH BEING O

1. A method of utilizing a computer having binary data storage means todetermine the manner in which a loom is to be operated for weaving amultilayer fabric whose respective layer have distinctive weavepatterns, said method comprising the steps of: a. operating saidcomputer to form in said data storage means a block diagonal type ofmatrix whose bits represent warp and weft thread crossings, said step(a) including the following subsidiary steps: a1. storing submatrices ofbits respectively representing said layer weave patterns as blocks innonoverlapping, diagonally adjacent relationship along a given diagonalof said matrix; a2. storing bits of a certain value (e.g., 1) in the bitstorage positions that are located within the said matrix on one side ofthe diagonally arranged blocks therein; and a3. storing bits of anotherbinary value (e.g., 0) in the bit storage positions that are locatedwithin said matrix on the other side of the diagonally arranged blockstherein; and b. operating said computer to rearranged the stored bitrepresentations of said block diagonal matrix in accordance with aninterleaving process whereby coordinate alignments of stored bitsextending through the respective submatrices are interleaved with eachother to provide a final matrix of stored bits representing variousthread actuating instructions that may be furnished to a loom forweaving a multilayer fabric wherein said weave patterns are positionedin different layers of the fabric and in manually overlappedrelationship.
 2. A method as set forth in claim 1 wherein said step (a)includes the following additional subsidiary step: a4. altering thevalue of any of the bits that were stored in said block diagonal matrixduring the performance of steps (a2) and (a3) in order to represent theinterlacing of selected layers at a selected point or points.
 3. Amethod of utilizing a computer having digital data storage means anddata manifesting means to form an array of bits representing the mannerin which warp and weft threads are to be manipulated by a loom in orderto weave a multilayer fabric having desired weave patterns in itsrespective layers, each of the bits which have a predetermined value(e.g., 1) representing the crossing of a warp thread over a weft threadin the fabric to be woven, and each of the bits which have the oppositevalve (e.g., 0) representing the crossing of a weft thread over a warpthread in said fabric, said method comprising the steps of: a. enteringinto said computer data which determines the placement of the weavepattern bits for each layer of said fabric with reference to the rowsaNd columns of a binary matrix to be formed in said data storage means;b. operating said computer to enter into those bit storing positionswhich are defined by the rows and columns allocated to each layer thebits that will represent the weave pattern for that layer; c. operatingsaid computer to store a bit having said predetermined value (e.g., 1)in each bit storing position of said storage means which is defined bythe intersection of a column allocated to any of the upper layers with arow allocated to any of the lower layers in said fabric; d. operatingsaid computer to store a bit of said opposite value (e.g. 0) in each bitstoring position of said storage means which is defined by theintersection of a row allocated to any of the upper layers with a columnallocated to any of the lower layers in said fabric; and e. operatingsaid data storage means and said data manifesting means in response tothe performance of said preceding steps for manifesting a final array ofbits representing the warp and weft thread crossings which are to beformed by the loom for weaving the desired multilayer fabric.
 4. Amethod as set forth in claim 3 wherein said step (e) includes thefollowing subsidiary steps: e1. operating said data storage means tointerleave the rows of bits extending through each of said layer weavepatterns with the rows of bits extending through each of the other layerweave patterns; and e2. operating said data storage means to interleavethe columns of bits extending through each of said layer weave patternswith the columns of bits extending through each of the other layer weavepatterns.
 5. A method as set forth in claim 4 wherein said step (e)further includes the following subsidiary step: e3. altering the valueof the bit stored at the intersection of any selected row extendingthrough one layer weave pattern with any selected column extendingthrough another layer weave pattern to denote an interlacing between therespective layers in the final array. 43
 6. A method of utilizing acomputer having binary data storage means to form an array of bitsindicating the manner in which a loom should be operated for weaving amultilayer fabric wherein two adjacent layers of said fabric have weavepatterns W1 and W2, respectively, each such pattern being repeatedthroughout the weave of its layer and being capable of representation bya rectangular array of bits, wherein the 1 and 0 values of said bitsrespectively represent opposite types of weft and warp thread crossings;the array for weave pattern W1 having M1 rows and N1 columns; the arrayfor weave pattern W2 having M2 rows and N2 columns; each of the rows insaid arrays corresponding to the position of a weft thread in saidfabric, and each of the columns in said arrays corresponding to theposition of a warp thread in said fabric; said method comprising thesteps of: a. operating said computer to form in said data storage meansa stored representation of a rectangular binary matrix containing a setof adjacent rows equal in number to M1 together with another set ofadjacent rows equal to M2, and containing a set of adjacent columnsequal in number to N1 together with said another set of adjacent columnsequal in number to N2, said step (a) including the following subsidiarysteps; a1. storing in the positions of said matrix defined by said setof M1 rows and said set of N1 columns the bits of weave pattern W1; a2.storing in the positions of said matrix defined by said set of M2 rowsand said set of N2 columns the bits of weave pattern W2; a3. storing insubstantially all of the positions of said matrix defined by said set ofM1 rows and said set of N2 columns bits having a selected one of thebinary values (e.g., 0); a4. storing in substantially all of thepositions of said matrix defined by said set of M2 rows and said set ofN1 columns bits having the other of the binary values (e.g., 1); said 0and 1 bits located in the respective positions specified by steps (a3)and (a4) above denoting that the weave patterns W1 and W2 respectivelyare positioned in different layers of the fabric; b. operating saidcomputer to transpose certain of the rows of said matrix, withoutthereby altering the contents of any such row, so that at least some ofthe rows containing bits of one weave pattern are interleaved with rowscontaining bits of another weave pattern in said matrix; c. operatingsaid computer to transpose certain of the columns of said matrix,without thereby altering the contents of any such column, so that atleast some of the columns containing bits of one weave pattern areinterleaved with columns containing bits of another weave pattern insaid matrix; and d. operating said computer in accordance with the finalarrangement of stored bits in the M1 and M2 rows and the N1 and N2columns of said matrix, after the transpositions thereof recited insteps (b) and (c) have been effected, to manifest, at least inrepresentative form, the various thread actuating instructions which aloom must be furnished in order to weave a multilayer fabric whereinsaid weave patterns W1 and W2 are in different layers of the fabric andoccupy mutually overlapped positions.
 7. A method as set forth in claim6 wherein said step (a) includes the following additional subsidiarystep: a5. altering the value of any selected bit that was stored in saidmatrix during steps (a3) and (a4) in order to define an interconnectionpoint between said two layers.
 8. A method of utilizing a computerhaving data storage means and data entering means to determine themanner in which warp threads and weft threads are to be manipulated by aloom for weaving a multilayer fabric wherein each layer has a selectedweave pattern that is capable of representation by a rectangular bitmatrix in which each ''''1'''' represents a warp-over-weft threadcrossing and each ''''0'''' represents a weft-over-warp thread crossing,said method comprising the following steps: a. operating said dataentering means to store in said data storage means a plurality ofrectangular bit matrices each identified as one of said layer matrices,said layer matrices being numbered for reference according to therelative order of their respective layers commencing with the topmostlayer of the fabric; b. operating said computer to rearrange said storedlayer matrices in a block diagonal matrix wherein said layer matricesare positioned successively in the order of their respective layernumbers and in diagonally adjacent relationship along one diagonal ofsaid matrix, said step (b) including the following subsidiary steps: b1.determining the row size value of said block diagonal matrix from thesum of the row sizes of said layer matrices; b2. determining the columnsize value of said block diagonal matrix from the sum of the columnsizes of said layer matrices; and b3. entering the respective rows ofsaid stored layer matrices successively into the respective rows of anarray contained within said data storage means according to the sequenceof layer numbers and row numbers of said layer matrices and in suchfashion that each row of said block diagonal matrix is formed byentering into said array a string of ''''1'''' bits equal in length tothe sum of the row sizes of all preceding layer matrices (if any),followed by a string of bits representing the current row of the currentlayer matrix, followed by a string of ''''0'''' bits equal in lengthdifference (if any), between said column size value and the sum of thecolumn sizes of the current layer matrix and all preceding layermatrices; and c. operating said computer to form in said data storagemeans a final matrix, derived from said block diagonal matrix, whereineach of a plurality of the rows containing the bits of each layer matrixis positioned adjacent to at least one row containing bits of adifferent layer matrix, and each layer matrix is positioned adjacent toat least one column containing bits of a different layer matrix; saidfinal matrix representing the overall pattern of warp and weft threadcrossings required to form a multilayer weave wherein the weave patternsof the respective layers are in superposed relationship to each other.9. A method as set forth in claim 8 wherein said step (c) includes theflowing subsidiary steps: c1. operating said computer to determine fromthe ratio between the row size of each layer matrix and the smallest ofthe row sizes of the several layer matrices the permutation of the rowsof said block diagonal matrix which would cause the rows of each layermatrix to be interleaved as evenly as possible with the rows of everyother layer matrix; c2. operating said computer to determine from theratio between the column size of each layer matrix and the smallest ofthe column sizes of the several layer matrices the permutation of thecolumns of said block diagonal matrix which would cause the columns ofeach layer matrix to be interleaved as evenly as possible with thecolumns of every other layer matrix; c3. operating said computer torecorder the rows of said block diagonal matrix in accordance with saidrow interleaving permutation, thereby to form a new matrix; and c4.operating said computer to recorder the columns of said new matrix inaccordance with said column interleaving permutation, thereby to formsaid final matrix.
 10. A method as set forth in claim 9 wherein saidstep (b) includes the following additional subsidiary steps: b4.operating said data entering means to define in said block diagonalmatrix the location of a point where a selected row of one layer matrixis to be interlaced with a selected column of a different layer matrix;and b5. adding a binary 1, by modulo-2-addition, to the bit located atsaid interlacing point, thereby changing the type of thread crossingspecified at that point.